- asymmetric encryption algorithm
- алгоритм асимметричного шифрования, алгоритм двухключевого шифрования, алгоритм шифрования с открытым ключом
English-Russian electronics dictionary .
English-Russian electronics dictionary .
GGH encryption algorithm — The Goldreich Goldwasser Halevi (GGH) signature scheme is an asymmetric key encryption algorithm proposed in 1995 and published in 1997, based on solving the close vector problem (CVP) in a lattice. The encrypter uses the public key, a bad… … Wikipedia
Optimal asymmetric encryption padding — This article is about the padding scheme used in public key cryptography. For the division of the Thailand Ministry of Science Technology and Environment entitled Office of Atomic Energy for Peace, see [1]. In cryptography, Optimal Asymmetric… … Wikipedia
Optimal Asymmetric Encryption Padding — This article is about the padding scheme used in public key cryptography. For the division of the Thailand Ministry of Science Technology and Environment entitled Office of Atomic Energy for Peace, see [http://www.oaep.go.th/english/index.html] … Wikipedia
Symmetric-key algorithm — Symmetric key algorithms are a class of algorithms for cryptography that use trivially related, often identical, cryptographic keys for both decryption and encryption.The encryption key is trivially related to the decryption key, in that they may … Wikipedia
data encryption — Process of disguising information as ciphertext, or data that will be unintelligible to an unauthorized person. Decryption is the process of converting ciphertext back into its original format, sometimes called plaintext (see cryptography).… … Universalium
ElGamal encryption — In cryptography, the ElGamal encryption system is an asymmetric key encryption algorithm for public key cryptography which is based on the Diffie Hellman key agreement. It was described by Taher Elgamal in 1984 [Taher ElGamal, A Public Key… … Wikipedia
Probabilistic encryption — is the use of randomness in an encryption algorithm, so that when encrypting the same message several times it will, in general, yield different ciphertexts. The term probabilistic encryption is typically used in reference to public key… … Wikipedia
Plaintext-aware encryption — Plaintext awareness is a notion of security for public key encryption. A cryptosystem is plaintext aware if it is difficult for any efficient algorithm to come up with a valid ciphertext without being aware of the corresponding plaintext.From a… … Wikipedia
40-bit encryption — refers to a key size of forty bits, or five bytes, for symmetric encryption; this represents a relatively low level of security. A forty bit length corresponds to a total of 2^{40} possible keys. Although this is a large number in human terms… … Wikipedia
Integrated Encryption Scheme — (IES) is a hybrid encryption scheme which provides semantic security against an adversary who is allowed to use chosen plaintext and chosen ciphertext attacks. The security of the scheme is based on the Diffie–Hellman problem. Two incarnations of … Wikipedia
Digital Signature Algorithm — The Digital Signature Algorithm (DSA) is a United States Federal Government standard or FIPS for digital signatures. It was proposed by the National Institute of Standards and Technology (NIST) in August 1991 for use in their Digital Signature… … Wikipedia